0333 - 3590 Improved Algorithms for the Feedback Vertex Set Problems
نویسندگان
چکیده
We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5kn). For unweighted graphs, our algorithm either constructs a feedback vertex set of size bounded by k in a given graph G, or reports that no such a feedback vertex set exists in G. For weighted graphs, our algorithm either constructs a minimum-weight feedback vertex set of size bounded by k in a given graph G, or reports that no feedback vertex set of size bounded by k exists in G.
منابع مشابه
ISSN 0333-3590 Pathwidth of cubic graphs and exact algorithms
We prove that for any ε > 0 there exists an integer nε such that the pathwidth of every cubic graph on n > nε vertices is at most (1/6 + ε)n. Based on this bound we improve the worst case time analysis for a number of exact exponential algorithms on graphs of maximum vertex degree three.
متن کاملISSN 0333-3590 A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs
An independent dominating set D of a graph G = (V, E) is a subset of vertices such that every vertex in V \ D has at least one neighbour in D and D is an independent set, i.e. no two vertices in D are adjacent. Finding a minimum independent dominating set in a graph is an NP-hard problem. Whereas it is hard to cope with this problem using parameterized and approximation algorithms, there is a s...
متن کاملImproved Algorithms for the Feedback Vertex Set Problems
We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5kn). The algorithms construct a feedback vertex set of size bounded by k (in the weighted case this set is of minimum weight among the feedback vertex set of size at most k) in a given graph G, or reports that no such a feedback vertex set exist...
متن کاملImproved Exact Exponential Algorithms for Vertex Bipartization and Other Problems
We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most 4. Our main results include: 1. an O(1.9526) 1 algorithm for Vertex Bipartization problem in undirected graphs; 2. an O(1.8384) algorithm for Vertex Bipartization problem in undirected graphs of maximum degree 3; 3. an O(1.945...
متن کاملReports in Informatics Issn 0333-3590 Lex M versus Mcs-m Lex M versus Mcs-m
We study the problem of minimal triangulation of graphs. One of the first algorithms to solve this problem is Lex M, which was presented in 1976. A new algorithm, and a simplification of Lex M, called MCS-M was presented in 2002. In this paper we compare these two algorithms and show that they produce the same set of chordal graphs, answering an open question mentioned by the authors of MCS-M.
متن کامل